Papers with compact model
F-coref: Fast, Accurate and Easy to Use Coreference Resolution (2022.aacl-demo)
Copied to clipboard
| Challenge: | Existing models for coreference resolution are difficult to implement, consume a lot of GPU memory and take long to process each document. |
| Approach: | They propose a python package for fast, accurate, and easy-to-use English coreference resolution. |
| Outcome: | The proposed model can process 2.8K OntoNotes documents in 25 seconds on a V100 GPU, compared to 6 minutes for the LingMess model and 12 minutes of the popular AllenNLP coreference model. |
RDRec: Rationale Distillation for LLM-based Recommendation (2024.acl-short)
Copied to clipboard
| Challenge: | Existing models that bridge users and items through textual prompts for effective semantic reasoning do not consider the underlying rationales behind interactions, such as user preferences and item attributes. |
| Approach: | They propose a rationale distillation recommender model that learns rationales generated by a larger language model (LM) by leveraging reviews related to users and items. |
| Outcome: | The proposed model achieves state-of-the-art (SOTA) performance in top-N and sequential recommendations. |
KNN-SSD: Enabling Dynamic Self-Speculative Decoding via Nearest Neighbor Layer Set Optimization (2026.findings-eacl)
Copied to clipboard
| Challenge: | Large language models (LLMs) have proven highly capable in handling downstream tasks, but the token-by-token generation in autoregressive decoding results in quadratic computational complexity. |
| Approach: | They propose a method that proposes skipping certain layers to construct a draft model, which eliminates the need for additional parameters or training. |
| Outcome: | The proposed method achieves 1.31.6 speedup in LLM inference while being sensitive to domain shifts. |
Adapters Selector: Cross-domains and Multi-tasks LoRA Modules Integration Usage Method (2025.coling-main)
Copied to clipboard
| Challenge: | Parameter-Efficient fine-tuning (PEFT) adapts large language models to specific domains by updating only a small portion of the parameters. |
| Approach: | They propose a framework for better integrating usage of multiple adapters by training a middleman adapter to select the appropriate adapter for inference. |
| Outcome: | The proposed framework can perform cross-domain multi-tasks effectively through the utilization of a compact model in combination with multiple LoRA modules. |
Structured Pruning Learns Compact and Accurate Models (2022.acl-long)
Copied to clipboard
| Challenge: | Pre-trained language models have high costs in terms of storage, memory, and computation time. |
| Approach: | They propose a task-specific structured pruning method CoFi which provides highly parallelizable subnetworks and matches distillation methods in both accuracy and latency. |
| Outcome: | The proposed method matches the distillation methods in accuracy and latency without resorting to unlabeled data. |
HalluDetect: Detecting, Mitigating, and Benchmarking Hallucinations in Conversational Systems in the Legal Domain (2025.emnlp-industry)
Copied to clipboard
Spandan Anaokar, Shrey Ganatra, Swapnil Bhattacharyya, Harshvivek Kashid, Shruthi N Nair, Reshma Sekhar, Siddharth Manohar, Rahul Hemrajani, Pushpak Bhattacharyya
| Challenge: | Large Language Models (LLMs) are widely used in industry but still produce hallucinations, limiting their reliability in critical applications. |
| Approach: | They propose to reduce hallucinations in consumer grievance chatbots by reducing their token accuracy by 0.4159 per turn. |
| Outcome: | The proposed system achieves an F1 score of 68.92% outperforming baseline detectors by 22.47% while maintaining the highest token accuracy. |
Small Language Models Improve Giants by Rewriting Their Outputs (2024.eacl-long)
Copied to clipboard
| Challenge: | despite impressive performance of large language models, they lag behind specialized models in various tasks. |
| Approach: | They propose a training model that can be integrated with different LLMs at inference to improve their performance without task-specific training. |
| Outcome: | The proposed model outperforms standard models on four natural language generation tasks. |
Improving Generalization of Pre-trained Language Models via Stochastic Weight Averaging (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Recent studies show that the flatness of the local minimum correlates well with better generalization. |
| Approach: | They propose to use a method encouraging convergence to a flatter minimum to fine-tune PLMs. |
| Outcome: | The proposed method outperforms state-of-the-art methods on NLP tasks without extra computation cost. |
Knowledge Distillation with Reptile Meta-Learning for Pretrained Language Model Compression (2022.coling-1)
Copied to clipboard
| Challenge: | Knowledge distillation (KD) can transfer knowledge from the original model into a compact model to achieve model compression. |
| Approach: | They propose a knowledge distillation method with reptile meta-learning to facilitate the transfer of knowledge from the teacher to the student. |
| Outcome: | Extensive experiments on the GLUE benchmark show the proposed method performs better than previous methods. |
Distill or Annotate? Cost-Efficient Fine-Tuning of Compact Models (2023.acl-long)
Copied to clipboard
| Challenge: | Increasing the size of pre-trained models can consistently improve performance on downstream tasks after fine-tuning, as seen in studies based on BERT, RoBERTa, T5 and empirical scaling laws. |
| Approach: | They propose to use knowledge distillation to build a compact model with a fixed budget instead of annotating data and manually labeling it. |
| Outcome: | The proposed approach reduces inference costs by reducing costs by hiring annotators and labelling data. |
FocalOrder: Focal Preference Optimization for Reading Order Detection (2026.acl-long)
Copied to clipboard
Fuyuan Liu, Dianyu Yu, He Ren, Nayu Liu, Xiaomian Kang, Delai Qiu, Fa Zhang, Genpeng Zhen, Shengping Liu, Liang Jiaen, null Weihuang, Yining Wang, Junnan Zhu
| Challenge: | Existing methods for document comprehension rely on uniform supervision, resulting in a performance degradation in the intermediate sections. |
| Approach: | They propose a framework driven by Focal Preference Optimization to detect reading order in document layouts. |
| Outcome: | The proposed framework outperforms competing baselines and surpasses large-scale general VLMs. |